Partial Evaluation of Call - by - value - calculus with Side - e ects

We present a framework of an online partial evaluator for a call-by-value -calculus with destructive updates of data structures. To our knowledge, this is the rst partial evaluator that can deal with full side-e ects as well as pointer equality in higher-order languages. Our partial evaluator uses a side-e ect analysis for handling assignment operations and then performs an online specialization using preactions. By separating mutable data structures from immutable ones using the side-e ect analysis, the most accesses to structured data (e.g., cons cells) are statically reduced at partial evaluation time. For the correct residualization of side-e ecting operations, preactions are used to solve various issues, such as code elimination, code duplication, and the order of execution. The resulting partial evaluator is simple enough to prove its correctness. Based on the framework, we extend it to a partial evaluator for almost full Scheme and demonstrate that it is powerful enough to specialize an interpreter written using side-e ects. ANY OTHER IDENTIFYING INFORMATION OF THIS REPORT DISTRIBUTION STATEMENT First issue 35 copies. SUPPLEMENTARY NOTES REPORT DATE